Parametric polymorphism and operational improvement
نویسندگان
چکیده
منابع مشابه
Parametric Polymorphism and Operational Improvement
Parametricity, in both operational and denotational forms, has long been a useful tool for reasoning about program correctness. However, there is as yet no comparable technique for reasoning about program improvement, that is, when one program uses fewer resources than another. Existing theories of parametricity cannot be used to address this problem as they are agnostic with regard to resource...
متن کاملParametric polymorphism and operational equivalence
Studies of the mathematical properties of impredicative polymorphic types have for the most part focused on the polymorphic lambda calculus of Girard-Reynolds, which is a calculus of total polymorphic functions. This paper considers polymorphic types from a functional programming perspective, where the partialness arising from the presence of fixpoint recursion complicates the nature of potenti...
متن کاملCombining Inclusion Polymorphism and Parametric Polymorphism
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the typability problem to the problem of solving a system of type inequations. The result is then obtained by showing that the solvability of the resulting system of ...
متن کاملParametric and Type-Dependent Polymorphism
In typed languages one can formally describe functions at any finite type, namely functions that take, as input, functions, functionals and so on. In general, higher types are obtained by type constructors, such as "→", "×" or "+". Higher order systems allow quantification over type variables, thus a higher order language must include variables both for individuals and types. The use of type va...
متن کاملParametric Polymorphism - Universally
In the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad-hoc polymorphic function satisfying a uniformity principle. This allowed him to prove that his set-theoretic semantics has a relational lifting which satisfies the Identity Extension Lemma and the Abstraction Theorem. However, his definition (and subsequent variants) have only been given for specific mode...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2018
ISSN: 2475-1421
DOI: 10.1145/3236763